package algorithm;

public class leetcode_0674 {
    public int findLengthOfLCIS(int[] nums) {
        int len=nums.length;
        int[] dp=new int[len];
        int max=1;
        for(int i=0;i<len;++i){
            dp[i]=1;
        }
        for(int i=1;i<len;++i){
            if(nums[i]>nums[i-1]) {dp[i]=dp[i-1]+1;max=Math.max(max,dp[i]);}
        }
        return max;
    }
}
